Counterexamples in measuring the distance between binary trees

Examples are given to show that the closest partition distance measure need not agree with the nearest neighbor interchange distance for unordered labeled binary trees. Proposed algorithms for computing the closest partition distance are shown to be of exponential complexity and hence may not be useful in approximating the nearest neighbor interchange distance.     

Information Theories with Adversaries,Intrinsic Information,and Entanglement

There are aspects of privacy theory that are analogous to quantum theory. In particular one can define distillable key and key cost in parallel to distillable entanglement and entanglement cost. We present here classical privacy theory as a particular case of information theory with adversaries, where similar general laws hold as in entanglement theory. We place the result of Renner and Wolf—that intrinsic information is lower bound for key cost—into this general formalism. Then we show that the question of whether intrinsic information is equal to key cost is equivalent to the question of whether Alice and Bob can create a distribution product with Eve using I_M bits of secret key. We also propose a natural analogue of relative entropy of entanglement in privacy theory and show that it is equal to the intrinsic information. We also provide a formula analogous to the entanglement of formation for classical distributions. It is our pleasure to dedicate this paper to Asher Peres on the occasion of his seventieth birthday.     

The identity is isolated among composition operators

Let be the Banach algebra of bounded holomorphic functions on the open unit ball of a Banach space. We show that the identity operator is an isolated point in the space of composition operators on . This answers a conjecture of Aron, Galindo and Lindström.

     

An example in holomorphic fixed point theory

If is the open unit ball in the Cartesian product furnished with the -norm , where and , then a holomorphic self-mapping of has a fixed point if and only if for some

     

Retrieval Properties of Bidirectional Associative Memories

We study a two-layer neural network made of N and M(N) neurons, producing a two-way association search for a family of p(N) patterns, where each pattern is a pair of two independent sub-categories of information having respectively N and M(N) components. In terms of the ratio =lim _N M(N)/N, we study the retrieval capability of this network and show that there exists, at least, three regimes of association for which we determine the evolution of the threshold _c () of the storage capacity =lim _N p(N)/N.     

Uniqueness and asymptotic behaviour for solutions of semilinear problems with boundary blow-up

In this paper we prove uniqueness of positive solutions to logistic singular problems , , 1$">, 0$"> in , where the main feature is the fact that . More importantly, we provide exact asymptotic estimates describing, in the form of a two-term expansion, the blow-up rate for the solutions near . This expansion involves both the distance function and the mean curvature of .

     

On the use of Laplace's equation for global predictions of internuclear separation and dissociation energy

Properties of target species can be estimated by various means including interpolations in periodic charts. Interpolation is equivalent to numerical solution of the Laplace equation. A test of this equivalence, within some confidence level, for any N-atomic molecule surrounded by 4N nearest neighbors: the sum of the second differences of the data in all directions must be zero. Since very few molecules have 4N neighbors with known data, the test becomes: the sum of the averages of the second differences must be zero. The validity of these tests is explored. For radii of main-group atoms, and for internuclear separations of their diatomic combinations, the averages are different from zero and the sums of the averages are zero to within one if second-nearest neighbors are used. Dissociation potentials pass the tests but with larger scatter. Predictions for dissociation potentials, using iterative interpolation within boundaries on which there are known data, are reviewed.     

Minimum Distance Bounds for s-Regular Codes

A code C F ⁿ is s-regular provided, forevery vertex x F ⁿ, if x is atdistance at most s from C then thenumber of codewords y C at distance ifrom x depends only on i and the distancefrom x to C. If denotesthe covering radius of C and C is -regular,then C is said to be completely regular. SupposeC is a code with minimum distance d,strength t as an orthogonal array, and dual degrees ^*. We prove that d 2t + 1 whenC is completely regular (with the exception of binaryrepetition codes). The same bound holds when C is(t + 1)-regular. For unrestricted codes, we show thatd s ^* + t unless C is a binary repetitioncode.     

Dead-time free measurement of dipole-dipole interactions between electron spins

A four-pulse version of the pulse double electron-electron resonance (DEER) experiment is presented, which is designed for the determination of interradical distances on a nanoscopic length-scale. With the new pulse sequence electron-electron couplings can be studied without dead-time artifacts, so that even broad distributions of electron-electron distances can be characterized. A version of the experiment that uses a pulse train in the detection period exhibits improved signal-to-noise ratio. Tests on two nitroxide biradicals with known length indicate that the accessible range of distances extends from about 1.5 to 8 nm. The four-pulse DEER spectra of an ionic spin probe in an ionomer exhibit features due to probe molecules situated both on the same and on different ion clusters. The former feature provides information on the cluster size and is inaccessible with previous methods.     

对物体沿散斑片纵向移动二次曝光全息干涉条纹的诠释

从光学几何关系出发,推导了在平行光照明、物体沿散斑片纵向方向微小移动情况下的一种全息干涉条纹的解释方法.该方法可以根据任一瞬间的条纹间距测量物体的位移,并适用于实时全息监测的定量分析,对全息干涉计量术提供有效的条纹解释方法和物体位移的计算方法.